Scheduling UET-UCT series-parallel graphs on two processors
نویسندگان
چکیده
منابع مشابه
Scheduling UET-UCT Series-Parallel Graphs on Two Processors
The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the makespan. A quadratic algorithm is proposed to compute an optimal schedule for a class of series-para...
متن کاملOptimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
The problem of scheduling a set of n unit execution time (UET) tasks subject to precedence constraints on m identical parallel processors is known to be N P -hard in the strong sense. However, polynomial time algorithms exist for some classes of precedence graphs. In this paper, we consider a class of divide-and-conquer graphs that naturally models the execution of the recursive control abstrac...
متن کاملScheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling uect (Unit Execution and Communication Time) trees on two identical processors: CBoS (clusters based on subtrees). The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non uet tasks. Nous pr esentons un n...
متن کاملScheduling UET task systems with concurrency on two parallel identical processors
Problems with unit execution time (UET) tasks and two identical parallel processors have received a great deal of attention in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a situation when a task may require both processors simultaneously. Following Lloyd, we term such task systems systems with concurrency. For problems with...
متن کاملOptimal scheduling for UET-UCT grids into fixed number of processors
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. In this paper we consider an enhanced model of the ndimensional grid by adding extra diagonal edges and allowing unequal b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00035-7